Overview of Verifiable Computing Techniques Providing Private and Public Verification
نویسندگان
چکیده
In this deliverable, we investigate the state-of-the-art in cryptographic approaches to verifiable computing. Verifiable computing encompasses methods that allow to delegate the computation of a function f on outsourced data x to third parties, such that the data owner and/or other third parties can verify that the outcome y = f(x) has been computed correctly by the third party. Thereby, approaches that are of prime interest are those providing an efficient verification process, i.e., it requires significantly lower computational costs to verify the correctness of the result than to perform the computation locally. In addition to presenting on overview of the state-of-the-art, we also highlight some interesting directions for future work. This document is issued within the frame and for the purpose of the Prismacloud project. This project has received funding from the European Union’s Horizon 2020 Programme for research, technological development and demonstration under grant agreement no. 644962. This document and its content are the property of the Prismacloud Consortium. All rights relevant to this document are determined by the applicable laws. Access to this document does not grant any right or license on the document or its contents. This document or its contents are not to be used or treated in any manner inconsistent with the rights or interests of the Prismacloud Consortium or the Partners detriment and are not to be disclosed externally without prior written consent from the Prismacloud Partners. Each Prismacloud Partner may use this document in conformity with the Prismacloud Consortium Grant Agreement provisions. Privacy and Security Maintaining Services in the Cloud Overview of Verifiable Computing Techniques Providing Private and Public Verification
منابع مشابه
Efficient Identity Based Public Verifiable Signcryption Scheme
Signcryption is a cryptographic primitive which performs encryption and signature in a single logical step. In conventional signcryption only receiver of the signcrypted text can verify the authenticity of the origin i.e. signature of the sender on the message after decrypting the cipher text. In public verifiable signcryption scheme anyone can verify the authenticity of the origin who can acce...
متن کاملCertificate Validation in Secure Computation and Its Use in Verifiable Linear Programming
For many applications of secure multiparty computation it is natural to demand that the output of the protocol is verifiable. Verifiability should ensure that incorrect outputs are always rejected, even if all parties executing the secure computation collude. Since the inputs to a secure computation are private, and potentially the outputs are private as well, adding verifiability is in general...
متن کاملIdentity Based Public Verifiable Signcryption Scheme
Signcryption as a single cryptographic primitive offers both confidentiality and authentication simultaneously. Generally in signcryption schemes, the message is hidden and thus the validity of the ciphertext can be verified only after unsigncrypting the ciphertext. Thus, a third party will not be able to verify whether the ciphertext is valid or not. Signcryption schemes that allow any user to...
متن کاملVerifiable Homomorphic Oblivious Transfer and Private Equality Test
We describe slightly modified version (that we call the HOT protocol) of the Aiello-Ishai-Reingold oblivious transfer protocol from Eurocrypt 2001. In particular, the HOT protocol will be what we call weakly secure when coupled with many different homomorphic semantically secure public-key cryptosystems. Based on the HOT protocol, we construct an efficient verifiable oblivious transfer protocol...
متن کاملPublic Verification of Private Effort
We introduce a new framework for polling responses from a large population. Our framework allows gathering information without violating the responders’ anonymity and at the same time enables public verification of the poll’s result. In contrast to prior approaches to the problem, we do not require trusting the pollster for faithfully announcing the poll’s results, nor do we rely on strong iden...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016